منابع مشابه
Minimal congestion trees
Let G be a graph and let T be a tree with the same vertex set. Let e be an edge of T and Ae and Be be the vertex sets of the components of T obtained after removal of e. Let EG(Ae, Be) be the set of edges of G with one endvertex in Ae and one endvertex in Be. Let ec(G : T ) := max e |EG(Ae, Be)|. The paper is devoted to minimization of ec(G : T ) • Over all trees with the same vertex set as G. ...
متن کاملDegrees in $k$-minimal label random recursive trees
This article describes the limiting distribution of the degrees of nodes has been derived for a kind of random tree named k-minimal label random recursive tree, as the size of the tree goes to infinity. The outdegree of the tree is equal to the number of customers in a pyramid marketing agency immediatly alluring
متن کاملFinding Minimum Congestion Spanning Trees
Given a graph G and a positive integer k, we want to nd k spanning trees on G, not necessarily disjoint, of minimum total weight, such that the weight of each edge is subject to a penalty function if it belongs to more than one tree. We present a polynomial time algorithm for this problem; the algorithm's complexity is quadratic in k. We also present two heuristics with complexity linear in k. ...
متن کاملMinimal Locked Trees
Locked tree linkages have been known to exist in the plane since 1998, but it is still open whether they have a polynomial-time characterization. This paper examines the properties needed for planar trees to lock, with a focus on finding the smallest locked trees according to different measures of complexity, and suggests some new avenues of research for the problem of algorithmic characterizat...
متن کاملReconstructing Minimal Rooted Trees
For a set T of rooted binary leaf-labelled trees, we present an algorithm that finds all of the minor-minimal trees that are compatible with T . The running time of this algorithm is polynomial up to the number of trees with this property. This type of problem arises in several areas of classification, particularly evolutionary biology.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2004
ISSN: 0012-365X
DOI: 10.1016/j.disc.2004.02.009